package br.ufrn.ciencomp.grafos;

import java.io.File;
import java.io.IOException;
import java.util.Scanner;

import br.ufrn.ciencomp.grafos.Grafo.Tipo;

public class Dijkstra {

	/*
	public ArrayList<Vertice> Dijkstra(Grafo g, int origem, int fim) {  
		//Implementar fila de prioridade
	}
	*/
	
	public static void main(String args[]) {
		try {
			Scanner scanner = new Scanner(new File("streams/dijkstra1.in"));
			
			Grafo g = new Grafo(scanner.nextInt(), Tipo.LISTA);
			
			while(scanner.hasNext()) {
				String instrucao = scanner.next();
				if(instrucao.startsWith("edge")) {
					g.addAresta(
							scanner.nextInt(), 
							scanner.nextInt(), 
							scanner.nextInt());
				} else if(instrucao.equals("prim")) {
					
				}
			}
		} catch(IOException e) {
			e.printStackTrace();
		}
	}
}
